Gradient-based recursive parameter estimation for a periodically nonuniformly sampled-data Hammerstein–Wiener system based on the key-term separation

The identification of the Hammerstein–Wiener (H-W) systems based on the nonuniform input–output dataset remains a challenging problem. This article studies the identification problem of a periodically nonuniformly sampled-data H-W system. In addition, the product terms of the parameters in the H-W system are inevitable. In order to solve the problem, the key-term separation is applied and two algorithms are proposed. One is the key-term-based forgetting factor stochastic gradient (KT-FFSG) algorithm based on the gradient search. The other is the key-term-based hierarchical forgetting factor stochastic gradient (KT-HFFSG) algorithm. Compared with the KT-FFSG algorithm, the KT-HFFSG algorithm gives more accurate estimates. The simulation results indicate that the proposed algorithms are effective.     

基于Simhash的安全密文排序检索方案

针对密文检索中存在的计算量大、检索效率不高的问题，提出一种基于Simhash的安全密文排序检索方案。该方案基于Simhash的降维思想构建安全多关键词密文排序检索索引（SMRI），将文档处理成指纹和向量，利用分段指纹和加密向量构建B+树，并采用"过滤-精化"策略进行检索和排序，首先通过分段指纹的匹配进行快速检索，得到候选结果集；然后通过计算候选结果集与查询陷门的汉明距离和向量内积进行排序，带密钥的Simhash算法和安全k近邻（SkNN）算法保证了检索过程的安全性。实验结果表明，与基于向量空间模型（VSM）的方案相比，基于SMRI的排序检索方案计算量小，能节约时间和空间成本，检索效率高，适用于海量加密数据的快速安全检索。     

基于stackelberg多步博弈的无人机协同搜索路径规划

考虑到现有无人机搜索问题研究中无人机、移动目标仅有一方具有远距离探测能力的设定，已经无法体现出战场环境下双方的博弈关系。针对这一不足，基于stackelberg均衡策略，结合多步预测的思想，提出了stackelberg多步博弈策略，实现了无人机、目标都具有远距离探测能力的博弈搜索。通过建立无人机、目标各自的路径收益函数，使双方能够根据不同时刻的博弈状态选择相对应的函数，实现无人机的动态路径规划。仿真结果表明所提出策略完全适用于该博弈模型，比贪婪策略具有更高的搜索效率，大大提高了目标捕获率。     

航班恢复问题的迭代局部搜索算法

在恶劣天气和机械故障等原因造成航班不能按照原计划执行时，航空公司需要采取相应的措施对航班进行恢复。本文基于经典的资源指派模型，综合考虑了调整时间、换机、联程拉直、取消航班和调机5种恢复策略，提出一种以最小化加权成本为优化目标的航班恢复模型，并设计一种迭代局部搜索算法。首先用构造-修复启发式方法构造可行解，然后从该初始解出发，在飞机路线对的邻域中进行局部搜索。当陷入局部最优后，对解进行扰动，然后从扰动后的解重新出发进行局部搜索。为了提高搜索效率，同时降低陷入局部最优解的概率，局部搜索过程采用模拟退火算法。实例结果表明，本文提出的模型及算法能够在短时间内对受到影响的大规模航班计划进行恢复。     

Querying on large and complex databases by content: Challenges on variety and veracity regarding real applications

The amount and variety of digital data currently being generated, stored and analyzed, including images, videos, and time series, have brought challenges to data administrators, analysts and developers, who struggle to comply with the expectations of both data owners and end users. The majority of the applications demand searching complex data by taking advantage of queries that analyze different aspects of the data, and need the answers in a timely manner. Content-based similarity retrieval techniques are well-suited to handle large databases, because they enable performing queries and analyses using features automatically extracted from the data, without users’ intervention. In this paper, we review and discuss the challenges posed to the database and related communities in order to provide techniques and tools that can meet the variety and veracity characteristics of big and complex data, while also considering the aspects of semantical preservation and completeness of the data. Examples and results obtained over a two-decade-long experience with real applications are presented and discussed.     

Why stop after 20 minutes? Breaks and target prevalence in a 60-minute X-ray baggage screening task

Current EU regulation restricts continuously reviewing X-ray images of passenger baggage to 20-min duration as a precautionary measure to prevent performance decrements in airport security officers (screeners). However, this 20-min limit is not based on clear empirical evidence on how well screeners can sustain their performance over time. Our study tested screeners in a 60-min simulated X-ray cabin baggage screening task. One group took 10-min breaks after 20 min of screening; the other group worked without breaks. We found no decrease in performance over 60 min in either group. Breaks did not affect performance, but they did reduce the amount of subjective distress. By varying target prevalence, we found that d_a with a slope of about 0.6 is a more valid measure of detection performance than d'. Target prevalence caused a criterion shift. Our results provide a basis for conducting field studies of prolonged screening durations, and open the discussion on whether more flexible break policies and work schedules should be considered.     

An improved cuckoo search algorithm and its application in vibration fault diagnosis for a hydroelectric generating unit

This article presents an improved cuckoo search (ICS) algorithm based on the parametric adaptation mechanism and non-uniform mutation. In the ICS algorithm, the biased random walk operator is modified to take advantage of the neighbourhood information of the current solution, and then the control parameters of step size, discovery probability and scaling factor are directly integrated into the optimized problems. Meanwhile, the non-uniform mutation operation is used to adaptively tune the search step of the current optimal solution. To evaluate the feasibility and efficiency of the presented algorithm, three groups of benchmark test functions are employed to perform the validation analysis. Subsequently, to diagnose the vibration fault of a hydroelectric generating unit, a combinational model is built, which combines ICS with a back-propagation neural network (ICSBP). The experimental results indicate that ICS is competitive on the optimization problems, and the ICSBP approach can effectively improve the accuracy of vibration fault diagnosis for a hydroelectric generating unit.     

User-friendly search interface for older adults: supporting search goal refreshing in working memory to improve information search strategies

ABSTRACT

This study investigates how a search interface that displays users’ ultimate query (i.e. users’ current search goal) can cope with the age-related decrease of fluid abilities and support older users’ search behaviours. 30 young and 18 older adults completed 9 search problems with a regular web browser or with the experimental search interface. Results showed that older adults spent longer time on the search engine result pages, they needed more time to reformulate, and they had more difficulties exploring the search paths elaborated. Age-differences also appeared as soon as the beginning of the search. The support tool helped older users reformulate their queries more rapidly and elaborate more flexible search strategies at the beginning of the activity. Indeed, older adults who interacted with the support tool switched to the processing of a new search path more rapidly instead of exploiting their initial query (i.e. they visited fewer websites for the initial query produced and reformulated a query instead of keeping on conducting a deeper investigation of the search results provided in the search engine result page). Implications of these findings for the design of effective support tools for older users are discussed.     

基于第三方物流的家具配送开放式车辆路径问题

为了降低家具配送成本,提高物流效率,基于第三方物流配送模式,构建了以总行驶距离最短和车辆数最少为最优目标的开放式车辆路径问题(open vehicle routing problem,OVRP)数学模型,并设计了一个改进的两阶段禁忌搜索算法进行求解,第1阶段求解包含所有客户的TSP(traveling salesman problem)路径来作为第2阶段划分OVRP路径的基础.设计了一个随机动态禁忌表,并将"邻域算子编号"和"邻域交换点对"同时作为禁忌对象,避免了过度禁忌的情况.另外,对5个邻域算子进行了测试,表明采用由点交换、分序点插入、点逆序和前点前向插入这4个算子组成的多邻域结构体效果最佳.经算例测试和文献对比,验证了设计算法的有效性,采用第三方物流配送比自营物流配送更节省成本.     

Scheduling distributed flowshops with flexible assembly and set-up time to minimise makespan

The scheduling problems under distributed production or flexible assembly settings have achieved increasing attention in recent years. This paper considers scheduling the integration of these two environments and proposes an original distributed flowshop scheduling problem with flexible assembly and set-up time. Distributed production stage is deployed several homogeneous flowshop factories that process the jobs to be assembled into final products in the flexible assembly stage. The objective is to find a schedule, including a production subschedule for jobs and an assembly subschedule for products, to minimise the makespan. Such a scheduling problem involves four successive decisions: assigning jobs to production factories, sequencing jobs at every factory, designating an assembly machine for each product and sequencing products on each assembly machine. The computational model is first established, and then a constructive heuristic (TPHS) and two hybrid metaheuristics (HVNS and HPSO) are proposed. Numerical experiments have been carried out and results validate the algorithmic feasibility and effectiveness. TPHS can obtain reasonable solutions in a shorter time, while metaheuristics can report better solutions using more yet acceptable time. HPSO is statistically comparable yet less robust compared with HVNS for small-scale instances. For the large-scale case, HPSO outperforms HVNS on both effectiveness and robustness.